arithmetic distance造句

• The arithmetic distance between two words is a measure of the number of errors made while computing an arithmetic operation.
• In either case, the arithmetic distance is 2 as expected since this is the number of errors that were made.
• To correct this error, an algorithm would be used to compute the nearest codeword to the received word in terms of arithmetic distance.
• Using the arithmetic distance is necessary since one error in an arithmetic operation can cause a large hamming distance between the received answer and the correct answer.
• These codes differ from most other codes in that they use arithmetic weight to maximize the arithmetic distance between codewords as opposed to the hamming weight and hamming distance.
• If A is not a factor of R, then at least one error has occurred and the most likely solution will be the codeword with the least arithmetic distance from R.
• The arithmetic distance of a word is upper bounded by its hamming weight since any integer can be represented by its standard polynomial form of x = \ sum _ { i = 1 } ^ n b _ i r ^ i where the b _ i are the digits in the integer.